Improving Black Hole Algorithm using Gravitational Search, White Hole Operator, and Local Search
نویسندگان
چکیده
منابع مشابه
The search for black hole binaries using a genetic algorithm
In this work we use genetic algorithm to search for the gravitational wave signal from the inspiralling massive Black Hole binaries in the simulated LISA data. We consider a single signal in the Gaussian instrumental noise. This is a first step in preparation for analysis of the third round of the mock LISA data challenge. We have extended a genetic algorithm utilizing the properties of the sig...
متن کاملSearch techniques for gravitational waves from black-hole ringdowns
The first kilometer-scale gravitational wave observatories, LIGO [1] and VIRGO [2], are expected to begin performing searches for astrophysical sources of gravitational waves in the year 2002. By this time, it will be necessary to have data analysis software for on-line searches. Because the anticipated signals are expected to be weak, near-optimal strategies for data analysis will be required ...
متن کاملApproximation Bounds for Black Hole Search Problems
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node without leaving any trace. The Black Hole Search is the task of locating all black holes in a network, through the exploration of its nodes by a set of mobile agents. In this paper we consider the problem of designing the fastest Black Hole Search, given the map...
متن کاملSynchronous black hole search in directed graphs
The paper considers a team of robots which has to explore a graphG where some nodes can be harmful. Robots are initially located at the so called home base node. The dangerous nodes are the so called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that the minimum number of robots is wasted. The explor...
متن کاملBlack Hole Search in Directed Graphs
We consider the problem of cooperative network exploration by agents under the assumption that there is a harmful host present in the network that destroys the incoming agents without outside trace – the so-called black hole search problem. Many variants of this problem have been studied, with various assumptions about the timing, agents’ knowledge about the topology, means of inter-agent commu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MEKATRONIKA
سال: 2019
ISSN: 2637-0883
DOI: 10.15282/mekatronika.v1i2.4891